Generating rooted triangulations without repetitions
نویسندگان
چکیده
منابع مشابه
Generating Rooted Triangulations with Minimum Degree Four
A graph is a triangulation if it is planar and every face is a triangle. A triangulation is rooted if the external triangular face is labelled. Two rooted triangulations with the same external face labels are isomorphic if their internal vertices can be labelled so that both triangulations have identical edge lists. In this article, we show that in the set of rooted triangulations on n points w...
متن کاملEfficient Generation of Plane Triangulations without Repetitions
A “based” plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations with at most n vertices. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulations but the ...
متن کاملGenerating Internally Triconnected Rooted Graphs
A biconnected plane graph G is called internally triconnected if any cut-pair consists of outer vertices and its removal results in only components each of which contains at least one outer vertex. In a rooted plane graph, an edge is designated as an outer edge with a specified direction. For given positive integers n ≥ 1 and g ≥ 3, let G3(n, g) (resp., Gint(n, g)) denote the class of all trico...
متن کاملGenerating Irreducible Triangulations of Surfaces
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined for the surfaces S0, S1, N1,and N2. An algorithm is presented for generating the irreducible triangulations of a fixed surface using triangulations of other ...
متن کاملCommon Edges in Rooted Trees and Polygonal Triangulations
Rotation distance between rooted binary trees measures the degree of similarity of two trees with ordered leaves and is equivalent to edge-flip distance between triangular subdivisions of regular polygons. There are no known polynomial-time algorithms for computing rotation distance. Existence of common edges makes computing rotation distance more manageable by breaking the problem into smaller...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1996
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01944353